Transversals of Additive Latin Squares
نویسندگان
چکیده
Let A = {a1, . . . , ak} and B = {b1, . . . , bk} be two subsets of an Abelian group G, k ≤ |G|. Snevily conjectured that, when G is of odd order, there is a permutation π ∈ Sk such that the sums ai+bπ(i), 1 ≤ i ≤ k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even when A is a sequence of k < |G| elements, i.e., by allowing repeated elements in A. In this last sense the result does not hold for other Abelian groups. With a new kind of application of the polynomial method in various finite and infinite fields we extend Alon’s result to the groups (Zp) and Zpα in the case k < p, and verify Snevily’s conjecture for every cyclic group of odd order.
منابع مشابه
Transversals in Latin Squares: A Survey
A latin square of order n is an n×n array of n symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of n entries containing no pair of entries that share the same row, column or symbol. Transversals are closely related to the notions of complete mappings and orthomorphisms in (quasi)groups, and are fundamental to the concept of mutuall...
متن کاملTransversals in Latin Squares
A latin square of order n is an n×n array of n symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of n entries such that no two entries share the same row, column or symbol. Transversals are closely related to the notions of complete mappings and orthomorphisms in (quasi)groups, and are fundamental to the concept of mutually orthogon...
متن کاملOn the number of transversals in latin squares
The logarithm of the maximum number of transversals over all latin squares of order n is greater than n6 (lnn + O(1)).
متن کاملThe number of transversals in a Latin square
A Latin square of order n is an n × n array of n symbols, in which each symbol occurs exactly once in each row and column. A transversal is a set of n entries, one selected from each row and each column of a Latin square of order n such that no two entries contain the same symbol. Define T (n) to be the maximum number of transversals over all Latin squares of order n. We show that bn ≤ T (n) ≤ ...
متن کاملMore mutually orthogonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.
متن کاملOn the existence of self-orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...
متن کامل